A representation theorem for recovering contraction relations satisfying wci

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Representation Theorem for Spatial Relations

Spatial relations have been investigated in various inter-related areas such as qualitative spatial reasoning (for agents moving in an environment), geographic information science, general topology, and others. Most of the results are specific constructions of spatial relations that fulfill some required properties. Results on setting up axioms that capture the desired properties of the relatio...

متن کامل

A Pseudo Representation Theorem for Various Categories of Relations

It is well-known that, given a Dedekind categoryR the category of (typed) matrices with coefficients from R is a Dedekind category with arbitrary relational sums. In this paper we show that under slightly stronger assumptions the converse is also true. Every atomic Dedekind category R with relational sums and subobjects is equivalent to a category of matrices over a suitable basis. This basis i...

متن کامل

Fuzzy implications satisfying convexity relations

It is an open question whether a non-trivial convex combination of triangular norms (resp. conorms) can be a triangular norm (resp. conorm). We investigate the analogous question for S-implications and R-implications.

متن کامل

Steiner loops satisfying Moufang's theorem

A loop satisfies Moufang’s theorem whenever the subloop generated by three associating elements is a group. Moufang loops (loops that satisfy the Moufang identities) satisfy Moufang’s theorem, but it is possible for a loop that is not Moufang to nevertheless satisfy Moufang’s theorem. Steiner loops that are not Moufang loops are known to arise from Steiner triple systems in which some triangle ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2003

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(02)00035-x